Paraconsistent Relational Model: A Quasi-Classic Logic Approach
نویسندگان
چکیده
The well-founded model for any general deductive database computed using the paraconsistent relational model, based on four-valued logic, does not support inference rules such as disjunctive syllogism. In order to support disjunctive syllogism, we utilize the generalization of the relational model to quasi-classic (QC) logic, whose inference power is much closer to classical logic. As the paraconsistent relational model is capable of representing incomplete and inconsistent data, we propose an algorithm to find QC model for inconsistent positive extended disjunctive deductive databases. To accomplish this, in addition to using existing generalized algebraic operators, we introduce two new operators FOCUSC and FOCUSD .
منابع مشابه
Handling Inconsistency in Knowledge Bases
Real-world automated reasoning systems, based on classical logic, face logically inconsistent information, and they must cope with it. It is onerous to develop such systems because classical logic is explosive. Recently, progress has been made towards semantics that deal with logical inconsistency. However, such semantics was never analyzed in the aspect of inconsistency tolerant relational mod...
متن کاملQuery Processing in Paraconsistent Databases in the Presence of Integrity Constraints
In this paper, we present an approach to query processing for paraconsistent databases in the presence of integrity constraints. Paraconsistent databases are capable of representing positive as well as negative facts and typically operate under the open world assumption. It is easily observed that integrity constraints are usually statements about negative facts and as a result paraconsistent d...
متن کاملA Generalized Disjunctive Paraconsistent Data Model for Negative and Disjunctive Information
This paper presents a generalization of the disjunctive paraconsistent relational data model in which disjunctive positive and negative information can be represented explicitly and manipulated. There are situations where the closed world assumption to infer negative facts is not valid or undesirable and there is a need to represent and reason with negation explicitly. We consider explicit disj...
متن کاملAn Extended Generalized Disjunctive Paraconsistent Data Model for Disjunctive Information
This paper presents an extension of generalized disjunctive paraconsistent relational data model in which pure disjunctive positive and negative information as well as mixed disjunctive positive and negative information can be represented explicitly and manipulated. We consider explicit mixed disjunctive information in the context of disjunctive databases as there is an interesting interplay be...
متن کاملA Novel Stable Model Computation Approach for General Dedcutive Databases
The aim of this thesis is to develop faster method for stable model computation of nonstratified logic programs and study its efficiency. It focuses mainly on the stable model and weak well founded semantics of logic programs. We propose an approach to compute stable models by where we first transform the logic program using paraconsistent relational model, then we compute the weak-well founded...
متن کامل